Reason Maintenance and the Ramsey Test ?
نویسنده
چکیده
The Ramsey test provides an intuitive link between conditionals and belief revision. How easy is it to incorporate a Ramseyaccount of conditionals in a reason maintenance system? In this paper, it is shown that this is indeed possible, within a relevance-logical framework. In addition, it is shown that independently motivated requirements on reason maintenance systems allow us to gracefully circumvent Gärdenfors’s triviality result.
منابع مشابه
A reason maintenance perspective on relevant Ramsey conditionals
This paper presents a Ramsey account of conditionals within the framework of an implemented reason maintenance system. The reason maintenance system is built on top of a deductive reasoning engine based on relevance logic. Thus, the account of conditionals provided is not susceptible to the fallacies of relevance. In addition, it is shown that independently motivated requirements on practical r...
متن کاملBelief ascription and the Ramsey test
In this paper, I analyse a finding by Riggs et al. (1998) that there is a close connection between people’s ability to reason with counterfactual conditionals and their capacity to attribute false beliefs to others. The result indicates that both processes may be governed by one cognitive mechanism, though false belief attribution seems to be slightly more cognitively demanding. Given that the ...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملThe Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کامل